Molecular replacement methods using a parallel processing machine
نویسندگان
چکیده
منابع مشابه
A Multi-Stage Single-Machine Replacement Strategy Using Stochastic Dynamic Programming
In this paper, the single machine replacement problem is being modeled into the frameworks of stochastic dynamic programming and control threshold policy, where some properties of the optimal values of the control thresholds are derived. Using these properties and by minimizing a cost function, the optimal values of two control thresholds for the time between productions of two successive nonco...
متن کاملParallel Machine Problems with Equal Processing Times
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملVMPP: A Proposal for a Virtual Machine for Parallel Processing
The field of parallel processing is young and rapidly evolving. Consequently, there is a great diversity of languages and architectures. To make matters worse these languages and architectures often become obsolete at a rapid pace. In this environment, portability becomes an extremely
متن کاملOn a parallel machine scheduling problem with equal processing times
In this paper, we give a polynomial algorithm for problem P | r j , p j = p | f j (C j), where f j is any non-decreasing function such that for any indices i and j, function f i − f j is monotonous, and a polynomial algorithm for problem P | r j , p j = p, D j | max ϕ j (C j), where ϕ j is any non-decreasing function for any j.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A Foundations of Crystallography
سال: 1996
ISSN: 0108-7673
DOI: 10.1107/s0108767396096365